Leader Election Algorithm in Wireless Environments Using Fibonacci Heap Structure
نویسندگان
چکیده
Today is an era of wireless communication systems. The day is not so far when the whole distributed system of the world will goes wireless. Leader in a distributed system plays a vital role in various computing environments like wireless networks etc. The main focus of researchers is on electing a new leader with lesser time consumption and with transmitting minimum number of messages in the network. Election of a leader using binary heap tree mechanism has garnered attention recently. But there are many other variants of heaps available in the literature which has better running time as compared to binary heaps. This paper presents design of leader election algorithm using a better variant called Fibonacci heap structure. Our design elects a new leader in O(1) time by passing lesser number of messages. The design is suitable in wireless environments.
منابع مشابه
Leader Election Algorithm Using Heap Structure
Several distributed algorithms require that there be a coordinator process in the entire system. Since all other processes in the system have to interact with the coordinator, they all must agree on who the coordinator is. Furthermore, if the coordinator process fails due to the failure of the site on which it is located, a new coordinator process must be elected to take up the job of the faile...
متن کاملPALE: Partially Asynchronous Agile Leader Election
Many tasks executed in dynamic distributed systems, such as sensor networks or enterprise environments with bring-your-owndevice policy, require central coordination by a leader node. In the past it has been proven that distributed leader election in dynamic environments with constant changes and asynchronous communication is not possible. Thus, state-of-the-art leader election algorithms are n...
متن کاملWave Leader Election Protocol for Wireless Sensor Networks
In this paper we present and analyze a wireless wave leader election protocol (WWLE) for wireless mobile ad hoc sensor networks. We present also a mathematical model for the energy consumption within a sensor node. The capabilities of a node being a leader (like available resources such as battery energy, network capabilities, etc.) are integrated in the algorithm. The simulation results show t...
متن کاملSecure Leader Election in Wireless Sensor Networks
Wireless sensor networks are networks of resourceconstrained embedded sensor devices. Oftentimes in these situations, it is beneficial to designate groups of sensors with leader nodes that relay information about the other nodes in the group, rather than maintaining communication with every single node in the group. Leaders can be chosen via leader election protocols, but it is especially impor...
متن کاملA Modified Leader Election Algorithm for MANET
Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate via message passing over wireless links. Communication takes place directly between nodes which are in transmission range of each other else communication is done through message relay. A MANET is different from existing distributed network ...
متن کامل